Investigating the Multi-memetic Mind Evolutionary Computation Algorithm Efficiency
نویسندگان
چکیده
منابع مشابه
Efficiency of Cryptography for Multi-Algorithm Computation on Dedicated Structures
Currently, the more efficient implementations for cryptographic engines are dedicated structures and only allow processing a single algorithm. On the other hand the existing multi-algorithm processors impose significantly higher costs, resulting in low efficiency structures. One possible solution is to use reconfigurable systems. However reconfigurable technologies impose additional costs, both...
متن کاملEfficiency Of Memetic And Evolutionary Computing In Combinatorial Optimisation
Difficult search and optimisation problems call for complex techniques for solving them. In particular, in cases when fitness function is costly, applying solutions, such as agent-based computing systems may be fruitful. This approach may yield even better results, in the case of memetic computing, as these algorithms tend to significantly increase the number of fitness function calls, because ...
متن کاملReduce Computation Steps Can Increase the Efficiency of Computation Algorithm
Problem statement: Lucas function is a special form of second-order linear recurrence relation. It is used in LUC cryptosystems. The performance of LUC cryptosystem depends on the size of public key, messages and two relatively primes. The increasing of size of these parameters will increase the computation time need to perform the LUC Cryptosystem computation. The efficiency means the quality ...
متن کاملAlignment Of Protein Structures With A Memetic Evolutionary Algorithm
CATEGORY: Real-World Applications Structural comparison of proteins is a core problem in modern biomedical research. Identifying structural similarities is essential for the assessment of the relationship between structure and function in proteins, and structural comparison techniques play a key role in applications like rational drug design. In this paper we consider a technique for protein st...
متن کاملAn Order Based Memetic Evolutionary Algorithm for Set Partitioning Problems
Metaheuristic algorithms, such as simulated annealing, tabu search and evolutionary algorithms, are popular techniques for solving optimization problems when exact methods are not practical. For example, the run times required to obtain exact solutions to many common combinatorial problems grow exponentially (or worse) with the problem size, and as a result, solving even a relatively modest siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Mathematical Modeling
سال: 2017
ISSN: 2412-5911
DOI: 10.24108/mathm.0617.0000090